Constraint Satisfaction: Algorithms and Complexity Course Notes
نویسنده
چکیده
1 Graph Homomorphisms 2 1.1 Graphs and Digraphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Graph Homomorphisms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3 The H-coloring Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.4 Cores . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.5 Polymorphisms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.6 The Arc-consistency Procedure . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.7 Tree Duality, the Set Graph, and Semilattice Polymorphisms . . . . . . . . . 14 1.8 The Path-consistency Procedure . . . . . . . . . . . . . . . . . . . . . . . . . 18 1.9 Majority Operations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
منابع مشابه
The Constraint Satisfaction Problem: Complexity and Approximability
During the past two decades, an impressive array of diverse methods from several different mathematical fields, including algebra, logic, analysis, probability theory, graph theory, and combinatorics, have been used to analyze both the computational complexity and approximabilty of algorithmic tasks related to the constraint satisfaction problem (CSP), as well as the applicability/limitations o...
متن کاملA Complexity Dichotomy for Poset Constraint Satisfaction
We determine the complexity of all constraint satisfaction problems over partial orders, in particular we show that every such problem is NP-complete or can be solved in polynomial time. This result generalises the complexity dichotomy for temporal constraint satisfaction problems by Bodirsky and Kára. We apply the so called universal-algebraic approach together with tools from model theory and...
متن کاملCombinatorial Optimization Algorithms via Polymorphisms
An elegant characterization of the complexity of constraint satisfaction problems has emerged in the form of the the algebraic dichotomy conjecture of [BKJ00]. Roughly speaking, the characterization asserts that a CSP Λ is tractable if and only if there exist certain non-trivial operations known as polymorphisms to combine solutions to Λ to create new ones. In an entirely separate line of work,...
متن کاملThe Complexity of Constraint Satisfaction Revisited
This paper is a retrospective account of some of the developments leading up to, and ensuing from, the analysis of the complexity of some polynomial network consistency algorithms for constraint satisfaction problems. 1 Historical Context In 1970 one of us (AKM) worked on an implementation of Huffman-Clowes [1] labeling of line drawings. This exploited the consequences of a deceptively simple c...
متن کاملWordwise Algorithms and Improved Heuristics for Solving Hard Constraint Satisfaction Problems
We present two improvements for solving constraint satisfaction problems. First, we show that on problems that truly bring out the exponential complexity of CSPs, wordwise algorithms are extremely e ective. Then, based on probabilistic models of CSP algorithms, we derive new variable ordering heuristics that incorporate local information. Our experimental results show substantial gains with res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013